Bounding Boxes for Compact Sets in E 2
نویسنده
چکیده
We introduce X is without zero as a synonym of X has non empty elements. We introduce X has zero as an antonym of X has non empty elements. Let us mention that R has zero and N has zero. Let us observe that there exists a set which is non empty and without zero and there exists a set which is non empty and has zero. Let us observe that there exists a subset of R which is non empty and without zero and there exists a subset of R which is non empty and has zero. We now state the proposition
منابع مشابه
Bounding Boxes for Compact Sets in E
We define pseudocompact topological spaces and prove that every compact space is pseudocompact. We also solve an exercise from [16] p.225 that the for a topological space X the following are equivalent: • Every continuous real map from X is bounded (i.e. X is pseudocompact). • Every continuous real map from X attains minimum. • Every continuous real map from X attains maximum. Finally, for a co...
متن کاملBounds on the quality of the PCA bounding boxes
Principal component analysis (PCA) is commonly used to compute a bounding box of a point set in R. The popularity of this heuristic lies in its speed, easy implementation and in the fact that usually, PCA bounding boxes quite well approximate the minimumvolume bounding boxes. We present examples of discrete points sets in the plane, showing that the worst case ratio of the volume of the PCA bou...
متن کاملHyperorthogonal Well-Folded Hilbert Curves
R-trees can be used to store and query sets of point data in two or more dimensions. An easy way to construct and maintain R-trees for two-dimensional points, due to Kamel and Faloutsos, is to keep the points in the order in which they appear along the Hilbert curve. The R-tree will then store bounding boxes of points along contiguous sections of the curve, and the efficiency of the R-tree depe...
متن کاملGeometric Applications of Principal Component Analysis
Bounding boxes are used in many applications for simplification of point sets or complex shapes. For example, in computer graphics, bounding boxes are used to maintain hierarchical data structures for fast rendering of a scene or for collision detection. Additional applications include those in shape analysis and shape simplification, or in statistics, for storing and performing range-search qu...
متن کاملOn Rectilinear Partitions with Minimum Stabbing Number
Let S be a set of n points in R, and let r be a parameter with 1 6 r 6 n. A rectilinear r-partition for S is a collection Ψ(S) := {(S1, b1), . . . , (St, bt)}, such that the sets Si form a partition of S, each bi is the bounding box of Si, and n/2r 6 |Si| 6 2n/r for all 1 6 i 6 t. The (rectilinear) stabbing number of Ψ(S) is the maximum number of bounding boxes in Ψ(S) that are intersected by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997